class TrieNode{
    TrieNode* children[26];
public:
    int count;
    TrieNode(){
        for(int i=0; i<26; i++){
            children[i]=NULL;
        }
        count=0;
    }
    TrieNode* get(char c){
        if(children[c-'a']==NULL){
            children[c-'a']=new TrieNode();
            count++;
        }
        return children[c-'a'];
    }
};

class Solution {
public:
    int minimumLengthEncoding(vector<string>& words) {
        TrieNode* trie=new TrieNode();
        unordered_map<TrieNode*, int> nodes;
        for(int i=0; i<words.size(); i++){
            string word=words[i];
            TrieNode* cur=trie;
            for(int j=word.length()-1; j>=0; j--){
                cur=cur->get(word[j]);
            }
            nodes[cur]=i;
        }

        int ans=0;
        for(auto& [node, idx]: nodes){
            if(node->count==0){
                ans+=words[idx].length()+1;
            }
        }
        
        return ans;

    }
};
